Cycle covers (I) – Minimal contra pairs and Hamilton weights
نویسندگان
چکیده
منابع مشابه
Cycle covers (I) - Minimal contra pairs and Hamilton weights
Article history: Received 30 April 2008 Available online 25 January 2010
متن کاملCycle double covers and spanning minors I
Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with even cycles has a cycle double cover, in fact a 6-CDC. We prove this for two other families of graphs similar to Kotzig graphs as well. In parti...
متن کاملHamilton weights and Petersen minors
A (1, 2)-eulerian weight w of a cubic graph is called a Hamilton weight if every faithful circuit cover of the graph with respect to w is a set of two Hamilton circuits. Let G be a 3-connected cubic graph containing no Petersen minor. It is proved in this paper that G admits a Hamilton weight if and only if G can be obtained from K4 by a series of4$Y-operations. As a byproduct of the proof of t...
متن کاملMinimal Covers and Arithmetical Sets1
If a and b are degrees of unsolvability, a is called a minimal cover of b if b<a and no degree c satisfies b<c<a. The degree a is called a minimal cover if it is a minimal cover of some degree b. We prove by a very simple argument that 0" is not a minimal cover for any n. From this result and the axiom of Borel determinateness (BD) we show that the degrees of arithmetical sets (with their usual...
متن کاملMINIMAL COVERS AND HYPERDEGREESf 1 )
Every hyperdegree at or above that of Kleene's O is the hyperjump and the supremum of two minimal hyperdegrees (Theorem 3.1). There is a nonempty ~ZX class of number-theoretic predicates each of which has minimal hyperdegree (Theorem 4.7). If V = L or a generic extension of L, then there are arbitrarily large hyperdegrees which are not minimal over any hyperdegree (Theorems 5.1, 5.2). If <?# ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2010
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2010.01.001